k-Fold unions of low-dimensional concept classes
نویسنده
چکیده
We show that 2 is the minimum VC dimension of a concept class whose k-fold union has VC dimension Ω(k log k).
منابع مشابه
The VC dimension of k-fold union
The known O(dk log k) bound on the VC dimension of k-fold unions or intersections of a given concept class with VC dimension d is shown to be asymptotically tight.
متن کاملLearning and Teaching of Boolean and Geometric Classes
We consider the concept classes of DNF formulas and unions of discretized, axis-parallel d-dimensional boxes in discretized d-dimensional space with respect to several different learning models. In the model of learning with queries we present an algorithm to learn unions of boxes. We introduce a model of teaching that prevents illicit communication between the teacher and the leaner but that c...
متن کاملLearning and Teaching of Boolean and Geometric Classes
We consider the concept classes of DNF formulas and unions of discretized, axis-parallel d-dimensional boxes in discretized d-dimensional space with respect to several different learning models. In the model of learning with queries we present an algorithm to learn unions of boxes. We introduce a model of teaching that prevents illicit communication between the teacher and the leaner but that c...
متن کاملLow dimensional flat manifolds with some classes of Finsler metric
Flat Riemannian manifolds are (up to isometry) quotient spaces of the Euclidean space R^n over a Bieberbach group and there are an exact classification of of them in 2 and 3 dimensions. In this paper, two classes of flat Finslerian manifolds are stuided and classified in dimensions 2 and 3.
متن کاملFinding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data
A pattern is a string of constant symbols and variables. The language de ned by a pattern p is the set of constant strings obtained from p by substituting nonempty constant strings for variables in p. In this paper we are concerning with polynomial time inference from positive data of the class of unions of a bounded number of pattern languages. We introduce a syntactic notion of minimal multip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009